Evaluation Methods and Algorithms for Web Search Ranking

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep-web Search Engine Ranking Algorithms

The deep web refers to content that is hidden behind HTML forms. The deep web contains a large collection of data that are unreachable by link-based search engines. A study conducted at University of California, Berkeley estimated that the deep web consists of around 91,000 terabytes of data, whereas the surface web is only about 167 terabytes. To access this content, one must submit valid inpu...

متن کامل

Web Search Relevance Ranking

Definition Web search engines return lists of web pages sorted by the page’s relevance to the user query. The problem with web search relevance ranking is to estimate relevance of a page to a query. Nowadays, commercial web-page search engines combine hundreds of features to estimate relevance. The specific features and their mode of combination are kept secret to fight spammers and competitors...

متن کامل

A New Hybrid Method for Web Pages Ranking in Search Engines

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...

متن کامل

Sound ranking algorithms for XML search

We argue that ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms not sound. We report t...

متن کامل

Approximation Algorithms for Diversified Search Ranking

In many search query applications, users tend to look at only the top part of the ranked result list in order to find relevant documents. Also, a fundamental issue in Web search is ranking search results based on user logs, since different users may have different preferences and intents with regards to a search query. The setting we consider contains various types of users, each of which is in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics

سال: 2010

ISSN: 1347-7986,1881-7203

DOI: 10.3156/jsoft.22.2_223